Adaptive space decomposition for fast visualization of soft objects

We present a scheme and a data structure that decomposes the space into adaptive-sized cells to improve the visualization of soft objects. Soft objects are visualized through the evaluation of field functions at every point of the space. According to the proposed scheme, the affecting soft objects for a point in the space is searched through the data structure called an interval tree based on the bounding volume of the components, which represent a soft object whose defining primitive(skeleton) is a simple geometric object, such as point or line segment. The bounding volume of each component is generated with respect to the radius of a local field function of the component, threshold value, and the relations between the components and the other neighboring components. The proposed scheme can be used in many applications for soft objects such as modeling and rendering, especially in the interactive modeling process.